A graphical formalism for mixed multi-unit combinatorial auctions
نویسندگان
چکیده
منابع مشابه
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
In this thesis three different approaches to the Winner Determination Problem (WDP) for Mixed Multi-Unit Combinatorial Auctions (MMUCA) are explored. The first, due to [Cerquides et al., 2007] is based on a traditional integer programming approach. The second, due to [Uckelman and Endriss, 2007] is based on constraint programing and the third is based on a division of the original problem in tw...
متن کاملComputationally-efficient winner determination for mixed multi-unit combinatorial auctions
Mixed Multi-Unit Combinatorial Auctions offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services. Their winner determination problem is an NP-hard problem that can be mapped into an integer program. Nonetheless, the computational cost of the current solution hinders the application of mixed multi-unit combinatorial auctions to reali...
متن کاملA mixed multi-unit combinatorial auctions test suite
Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to solve SCF problems, and thus be employed for the automated assembly of supply chains of agents. In this paper we present MMUCATS, a test suite for MMUCAs that al...
متن کاملCharting the Tractability Frontier of Mixed Multi-Unit Combinatorial Auctions
Mixed multi-unit combinatorial auctions (MMUCAs) are extensions of classical combinatorial auctions (CAs) where bidders trade transformations of goods rather than just sets of goods. Solving MMUCAs, i.e., determining the sequences of bids to be accepted by the auctioneer, is computationally intractable in general. However, differently from CAs, little was known about whether polynomialtime solv...
متن کاملOn the empirical evaluation of Mixed Multi-Unit Combinatorial Auctions
Mixed Multi-Unit Combinatorial Auctions (MMUCA) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services, and in general the MMUCA extends and generalises all the preceding types of combinatorial auctions. However, lit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Autonomous Agents and Multi-Agent Systems
سال: 2009
ISSN: 1387-2532,1573-7454
DOI: 10.1007/s10458-009-9085-x